Calibrating Recurrent Sliding Window Classifiers for Sequential Supervised Learning

نویسندگان

  • Saket Joshi
  • Thomas G. Dietterich
چکیده

Sequential supervised learning problems involve assigning a class label to each item in a sequence. Examples include part-of-speech tagging and text-to-speech mapping. A very general-purpose strategy for solving such problems is to construct a recurrent sliding window (R.SW) classifier, which maps some window of the input sequence plus some number of previously-predicted items into a prediction for the next item in the sequence. Tins paper describes a general-purpose implementation of RSW classifiers and discusses time highly practical issue of how to choose the size of time input window and the number of previous predictions to incorporate. Experiments on two real-world domains show that the optimal choices vary from one learning algorithm to another. They also depend on the evaluation criterion (number of correctly-predicted items versus number of correctly-predicted whole sequences). We conclude that window sizes must be chosen by cross-validation. The results have implications for the choice of window sizes for other models including hidden Markov models and conditional random fields.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple Instance Reinforcement Learning for Efficient Weakly-Supervised Detection in Images

State-of-the-art visual recognition and detection systems increasingly rely on large amounts of training data and complex classifiers. Therefore it becomes increasingly expensive both to manually annotate datasets and to keep running times at levels acceptable for practical applications. In this paper, we propose two solutions to address these issues. First, we introduce a weakly supervised, se...

متن کامل

A2-RL: Aesthetics Aware Reinforcement Learning for Automatic Image Cropping

Image cropping aims at improving the aesthetic quality of images by adjusting their composition. Most weakly supervised cropping methods (without bounding box supervision) rely on the sliding window mechanism. The sliding window mechanism requires fixed aspect ratios and limits the cropping region with arbitrary size. Moreover, the sliding window method usually produces tens of thousands of win...

متن کامل

Machine Learning for Sequential Data: A Review

Statistical learning problems in many fields involve sequential data. This paper formalizes the principal learning tasks and describes the methods that have been developed within the machine learning research community for addressing these problems. These methods include sliding window methods, recurrent sliding windows, hidden Markov models, conditional random fields, and graph transformer net...

متن کامل

A Supervised Classifier for Multispectral and Textured Images Based on an Automated Region Growing Algorithm

A couple of supervised classifiers to segment optical multispectral images and textured radar images has been developed. In both classifiers, an automated regiongrowing algorithm delineates the training sets. Optimum statistics for defined classes are derived from the training sets. This algorithm handles three parameters: an initial pixel seed, a window and a threshold for each class. A suitab...

متن کامل

10_19o - A Supervised Classifier for Multispectral and Textured Images Based on an Automated Region Growing Algorithm

A couple of supervised classifiers to segment optical multispectral images and textured radar images has been developed. In both classifiers, an automated regiongrowing algorithm delineates the training sets. Optimum statistics for defined classes are derived from the training sets. This algorithm handles three parameters: an initial pixel seed, a window and a threshold for each class. A suitab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012